Remarks on addition processes of positive floating-point numbers
نویسندگان
چکیده
منابع مشابه
Floating Point Numbers
The natural arithmetic operand in a computer is the binary integer. However, the range of numbers that can be represented is limited by the computer’s word size. We cannot represent very large or very small numbers. For example, in a computer with a 32 bit word, the largest signed number is 2 – 1. The range is further diminished if some bits of the word are used for fractions. There are techniq...
متن کاملDensity results on floating-point invertible numbers
Let Fk denote the k-bit mantissa "oating-point (FP) numbers. We prove a conjecture of Muller according to which the proportion of numbers in Fk with no FP-reciprocal (for rounding to the nearest element) approaches 2 − 2 log 3 ≈ 0:06847689 as k → ∞. We investigate a similar question for the inverse square root. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملSecure Computation on Floating Point Numbers
Secure computation undeniably received a lot of attention in the recent years, with the shift toward cloud computing offering a new incentive for secure computation and outsourcing. Surprisingly little attention, however, has been paid to computation with non-integer data types. To narrow this gap, in this work we develop efficient solutions for computation with real numbers in floating point r...
متن کاملReal Behavior of Floating Point Numbers
We present an efficient constraint programming (CP) approach to the SMTLIB theory of quantifier-free floating-point arithmetic (QF FP). We rely on dense interreduction between many domain representations to greatly reduce the search space. We compare our tool to current state-of-the-art SMT solvers and show that it is consistently better on large problems involving non-linear arithmetic operati...
متن کاملAn Improved Floating Point Addition Algorithm
Floating point addition/subtraction has been designed in literature. The methods involved two’s complements add/subtract logic and XOR for counting leading zeroes. This paper proposes algorithm to perform add/subtract operation using one’s complement and counting leading zeroes for normalization using NOR operation as reduction operator for two bits of mantissa at a time. The proposed model is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1974
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-14-3-415-417